On sojourn times in the finite capacity queue with processor sharing
نویسندگان
چکیده
منابع مشابه
On sojourn times in the finite capacity M/M/1 queue with processor sharing
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojour...
متن کاملSojourn times in a processor sharing queue with service interruptions
We study the sojourn time of customers in an M/M/1 queue with processor sharing service discipline and service interruptions. The lengths of the service interruptions have a general distribution, whereas the periods of service availability are assumed to have an exponential distribution. A branching process approach is shown to lead to a decomposition of the sojourn time into independent contri...
متن کاملSojourn times in a processor sharing queue with multiple vacations
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribu...
متن کاملSojourn Times in the M/PH/1 Processor Sharing Queue
We give in this paper an algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times. In a first step, we establish the differential system governing the conditional sojourn times probability distributions in this queue, given the number of customers in the different phases of the PH distribution...
متن کاملOn the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers on the Sojourn times for Many-queue Head-of-the-line Processor-sharing Systems with Permanent Customers 1
We consider a single server system consisting of n queues with diierent types of customers (Poisson streams) and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). The stability condition and a pseudo work conservation law will be given for arbitrary service time distrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2009
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.09.007